All Questions
16 questions
2votes
3answers
262views
Mapping words to letters which contains
Given sentence for example: ala ma kota, kot koduje w Javie kota I should to every letter occurring in the sentence I should map every string that this letter ...
- 183
5votes
3answers
6kviews
Generating all possible combinations of a string using iteration
I am generating all possible combinations from a string concatenated. I have a \$O(n*2^n)\$ solution. ...
- 153
1vote
1answer
130views
Producing residues of combinatorics on strings
Basically, this code does multiplication of chosen operations. ...
user85591
2votes
1answer
838views
Efficient String permutations calculation in Java
In trying to compute permutations of a given String, what can I do to further improve the code below for memory and/or time efficiency? ...
2votes
1answer
2kviews
Iterative solution for generating all permutations of a string
I know the runtime for generating all permutations is supposed to be \$O(n!)\$. I'm not sure if the code I wrote for it runs in \$O(n!)\$ though. I'm having trouble analyzing its runtime. The ...
- 331
3votes
2answers
3kviews
Non-Contiguous Substrings
Problem: A non-contiguous substring of string \$s\$ is a sequence of \$k \geq 0\$ characters in \$s\$, in the order in which they occur in \$s\$. For instance, the set of all non-contiguous ...
- 139
2votes
1answer
828views
Generate all possible permutations from a string with character repetitions
I want to know if my code is good, with reasonable efficiency, and if it is possible to improve my code and how. What would you suggest? ...
- 181
10votes
2answers
449views
You need to diversify your strings
Challenge: Write a program which prints all the permutations of a string in alphabetical order. Specifications: Your program should accept a file as its first argument. The file contains input ...
- 9,839
1vote
1answer
448views
Permutations of a string
I wrote the following code to permute the characters of a string assuming there is no repeated character. I also want to make sure the space complexity of this algorithm is \$O(n*n!)\$: There are \$...
- 743
4votes
1answer
154views
String manipulations (reverse a string by characters, permutation)
I'm trying to solve simple Java problems in various ways. Could anyone comment about the code, like how it could be better, and what could be a problem? ...
9votes
2answers
775views
Optimizing String combinations in Java
I need to obtain all combinations of a String of length k from the given elements. For example, for ...
3votes
3answers
10kviews
Permutation of a string eliminating duplicates
This code lists the permutations of the string, and eliminates duplicates if any. I'm looking for code review, best practices, optimizations etc. I'm also verifying complexity: \$O(n! * n)\$ as time ...
- 8,451
6votes
3answers
89kviews
Calculate all possible combinations of given characters
I was asked in my textbook Lectures on Discrete Mathematics for Computer Science to construct a program that would take an alphabet ({a,b,c} or any combination of ...
Phazor
3votes
2answers
186views
Determine if a word can be constructed from list of subsets - follow-up
I have reworked my code as suggested from my previous question: Determine if a word can be constructed from list of subsets. Please instruct me on the complexity along with a review feedback, as ...
- 8,451
2votes
2answers
193views
Determine if a word can be constructed from list of subsets [closed]
The question is explained well by examples in the comments below. Also I request verifying complexity: O( n * n!), where n is the number of words in the subsets. Review my code for optimizations, ...
- 8,451
